Drawing graphs nicely using simulated annealing
نویسندگان
چکیده
منابع مشابه
Mental map preserving graph drawing using simulated annealing
Visualizing graphs has been studied extensively in the community of graph drawing and information visualization over the years. In some applications, the user is required to interact with a graph by making slight changes to the underlying graph structure. To visualize graphs in such an interactive environment, it is desirable that the differences between the displays of the original and the mod...
متن کامل3D Graph Drawing with Simulated Annealing
A recent trend in graph drawing is directed to the visualiza-tion of graphs in 3D 1, 5, 6]. A promising research direction concerns the extension of proven 2D techniques to 3D. We present a system extending the simulated annealing algorithm of Davidson and Harel 2] for straight-line two-dimensional drawings of general undirected graphs to three dimensions. This system features an advanced 3D us...
متن کاملDrawing Trees Nicely with TeX
SUMMARY We present a new solution to the tree drawing problem that integrates an excellent tree drawing algorithm into one of the best text processing systems available. More precisely, we present a T E X macro package called TreeT E X that produces drawings of trees from a purely logical description. Our approach has three advantages: labels for nodes can be handled in a reasonable way; portin...
متن کاملPhase Balancing using Simulated Annealing
Deregulation eliminates the boundary of the territory of the monopoly power industry. Competition forces utilities to improve power quality as well as to reduce investment and operation costs. Feeder imbalance describes a situation in which the voltages of a three-phase voltage source are not identical in magnitude, or the phase differences between them are not 120 electrical degrees, or both. ...
متن کاملInstruction Scheduling Using Simulated Annealing
Most nodes of modern massively-parallel computing systems contain processors that use instruction-level parallelism to increase the speed of the individual processor. In order to achieve the greatest speedup possible, the compiler must perform instruction scheduling so that instructions are presented to the processor in the order that is most efficient. Instruction scheduling is a compiler prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 1996
ISSN: 0730-0301,1557-7368
DOI: 10.1145/234535.234538